0.08/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.09	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.08/0.29	% Computer   : n002.cluster.edu
0.08/0.29	% Model      : x86_64 x86_64
0.08/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.29	% Memory     : 8042.1875MB
0.08/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.08/0.29	% CPULimit   : 1200
0.08/0.29	% WCLimit    : 120
0.08/0.29	% DateTime   : Tue Jul 13 15:24:03 EDT 2021
0.08/0.29	% CPUTime    : 
0.08/0.29	% Number of cores: 8
0.08/0.29	% Python version: Python 3.6.8
0.08/0.29	# Version: 2.6rc1-ho
0.08/0.29	# No SInE strategy applied
0.08/0.29	# Trying AutoSched0 for 59 seconds
0.13/0.36	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S075I
0.13/0.36	# and selection function SelectCQAr.
0.13/0.36	#
0.13/0.36	# Preprocessing time       : 0.029 s
0.13/0.36	# Presaturation interreduction done
0.13/0.36	
0.13/0.36	# Proof found!
0.13/0.36	# SZS status Theorem
0.13/0.36	# SZS output start CNFRefutation
0.13/0.36	thf(breln1, axiom, (breln1)=(^[X1:$i, X4:$i]:subset @ X4 @ (cartprod @ X1 @ X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1)).
0.13/0.36	thf(breln, axiom, (breln)=(^[X1:$i, X2:$i, X3:$i]:subset @ X3 @ (cartprod @ X1 @ X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln)).
0.13/0.36	thf(setOfPairsIsBReln1, axiom, (setOfPairsIsBReln1<=>![X1:$i, X5:$i > $i > $o]:breln1 @ X1 @ (dpsetconstr @ X1 @ X1 @ (^[X6:$i, X7:$i]:X5 @ X6 @ X7))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setOfPairsIsBReln1)).
0.13/0.36	thf(breln1invprop, conjecture, (![X1:$i, X4:$i]:(breln1 @ X1 @ X4=>breln1 @ X1 @ (breln1invset @ X1 @ X4))<=setOfPairsIsBReln1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1invprop)).
0.13/0.36	thf(breln1invset, axiom, (breln1invset)=(^[X1:$i, X4:$i]:dpsetconstr @ X1 @ X1 @ (^[X6:$i, X7:$i]:in @ (kpair @ X7 @ X6) @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1invset)).
0.13/0.36	thf(c_0_5, axiom, (breln1)=(^[X1:$i, X4:$i]:subset @ X4 @ (cartprod @ X1 @ X1)), inference(apply_def,[status(thm)],[breln1, breln])).
0.13/0.36	thf(c_0_6, axiom, (setOfPairsIsBReln1)=(![X1:$i, X5:$i > $i > $o]:subset @ (dpsetconstr @ X1 @ X1 @ (^[X6:$i, X7:$i]:X5 @ X6 @ X7)) @ (cartprod @ X1 @ X1)), inference(apply_def,[status(thm)],[setOfPairsIsBReln1, c_0_5])).
0.13/0.36	thf(c_0_7, plain, ![X7:$i, X6:$i, X5:$i > $i > $o]:(epred2_3 @ X5 @ X6 @ X7<=>X5 @ X6 @ X7), introduced(definition)).
0.13/0.36	thf(c_0_8, negated_conjecture, ~((![X1:$i, X5:$i > $i > $o]:subset @ (dpsetconstr @ X1 @ X1 @ (epred2_3 @ X5)) @ (cartprod @ X1 @ X1)=>![X1:$i, X4:$i]:(subset @ X4 @ (cartprod @ X1 @ X1)=>subset @ (breln1invset @ X1 @ X4) @ (cartprod @ X1 @ X1)))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1invprop]), c_0_5]), c_0_6]), c_0_7])])).
0.13/0.36	thf(c_0_9, plain, ![X13:$i, X12:$i, X4:$i]:(epred1_3 @ X4 @ X12 @ X13<=>in @ (kpair @ X13 @ X12) @ X4), introduced(definition)).
0.13/0.36	thf(c_0_10, plain, ![X23:$i, X24:$i, X25:$i > $i > $o]:((~epred2_3 @ X25 @ X24 @ X23|X25 @ X24 @ X23)&(~X25 @ X24 @ X23|epred2_3 @ X25 @ X24 @ X23)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
0.13/0.36	thf(c_0_11, negated_conjecture, ![X16:$i, X17:$i > $i > $o]:(subset @ (dpsetconstr @ X16 @ X16 @ (epred2_3 @ X17)) @ (cartprod @ X16 @ X16)&(subset @ esk2_0 @ (cartprod @ esk1_0 @ esk1_0)&~subset @ (breln1invset @ esk1_0 @ esk2_0) @ (cartprod @ esk1_0 @ esk1_0))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
0.13/0.36	thf(c_0_12, plain, ![X1:$i, X4:$i]:(breln1invset @ X1 @ X4)=(dpsetconstr @ X1 @ X1 @ (epred1_3 @ X4)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[breln1invset]), c_0_9])).
0.13/0.36	thf(c_0_13, plain, ![X1:$i, X5:$i > $i > $o, X2:$i]:(epred2_3 @ X5 @ X1 @ X2|~X5 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_10])).
0.13/0.36	thf(c_0_14, negated_conjecture, ![X5:$i > $i > $o, X1:$i]:subset @ (dpsetconstr @ X1 @ X1 @ (epred2_3 @ X5)) @ (cartprod @ X1 @ X1), inference(split_conjunct,[status(thm)],[c_0_11])).
0.13/0.36	thf(c_0_15, plain, ![X14:$i, X15:$i]:(breln1invset @ X14 @ X15)=(dpsetconstr @ X14 @ X14 @ (epred1_3 @ X15)), inference(variable_rename,[status(thm)],[c_0_12])).
0.13/0.36	thf(c_0_16, plain, ![X5:$i > $i > $o, X1:$i]:epred2_3 @ subset @ (dpsetconstr @ X1 @ X1 @ (epred2_3 @ X5)) @ (cartprod @ X1 @ X1), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.13/0.36	thf(c_0_17, plain, ![X1:$i, X2:$i]:(breln1invset @ X1 @ X2)=(dpsetconstr @ X1 @ X1 @ (epred1_3 @ X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.13/0.36	thf(c_0_18, plain, ![X1:$i, X2:$i, X5:$i > $i > $o]:(epred2_3 @ subset @ (breln1invset @ X1 @ X2) @ (cartprod @ X1 @ X1)|(epred1_3 @ X2)!=(epred2_3 @ X5)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_16, c_0_17])])).
0.13/0.36	thf(c_0_19, plain, ![X1:$i, X5:$i > $i > $o, X2:$i]:(epred2_3 @ subset @ (breln1invset @ X1 @ X2) @ (cartprod @ X1 @ X1)|(epred1_3 @ X2 @ (esk5_2 @ X5 @ X2) @ (esk6_2 @ X5 @ X2))!=(epred2_3 @ X5 @ (esk5_2 @ X5 @ X2) @ (esk6_2 @ X5 @ X2))), inference(neg_ext,[status(thm)],[c_0_18])).
0.13/0.36	thf(c_0_20, plain, ![X1:$i, X5:$i > $i > $o, X2:$i]:(X5 @ X1 @ X2|~epred2_3 @ X5 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_10])).
0.13/0.36	thf(c_0_21, plain, ![X1:$i, X5:$i > $i > $o, X2:$i]:(epred2_3 @ subset @ (breln1invset @ X1 @ X2) @ (cartprod @ X1 @ X1)|epred2_3 @ X5 @ (esk5_2 @ X5 @ X2) @ (esk6_2 @ X5 @ X2)|epred1_3 @ X2 @ (esk5_2 @ X5 @ X2) @ (esk6_2 @ X5 @ X2)), inference(dynamic cnf,[status(thm)],[c_0_19])).
0.13/0.36	thf(c_0_22, plain, ![X1:$i, X5:$i > $i > $o, X2:$i]:(epred1_3 @ X1 @ (esk5_2 @ X5 @ X1) @ (esk6_2 @ X5 @ X1)|epred2_3 @ X5 @ (esk5_2 @ X5 @ X1) @ (esk6_2 @ X5 @ X1)|subset @ (breln1invset @ X2 @ X1) @ (cartprod @ X2 @ X2)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.13/0.36	thf(c_0_23, plain, ![X5:$i > $i > $o, X2:$i, X1:$i]:(epred1_3 @ X1 @ (esk5_2 @ X5 @ X1) @ (esk6_2 @ X5 @ X1)|subset @ (breln1invset @ X2 @ X1) @ (cartprod @ X2 @ X2)|X5 @ (esk5_2 @ X5 @ X1) @ (esk6_2 @ X5 @ X1)), inference(spm,[status(thm)],[c_0_20, c_0_22])).
0.13/0.36	thf(c_0_24, plain, ![X1:$i, X2:$i]:(epred1_3 @ X1 @ (esk5_2 @ (epred1_3 @ X1) @ X1) @ (esk6_2 @ (epred1_3 @ X1) @ X1)|subset @ (breln1invset @ X2 @ X1) @ (cartprod @ X2 @ X2)), inference(ef,[status(thm)],[c_0_23])).
0.13/0.36	thf(c_0_25, plain, ![X1:$i, X5:$i > $i > $o, X2:$i]:(epred2_3 @ subset @ (breln1invset @ X1 @ X2) @ (cartprod @ X1 @ X1)|~epred1_3 @ X2 @ (esk5_2 @ X5 @ X2) @ (esk6_2 @ X5 @ X2)|~epred2_3 @ X5 @ (esk5_2 @ X5 @ X2) @ (esk6_2 @ X5 @ X2)), inference(dynamic cnf,[status(thm)],[c_0_19])).
0.13/0.36	thf(c_0_26, plain, ![X1:$i, X2:$i]:(epred2_3 @ (epred1_3 @ X1) @ (esk5_2 @ (epred1_3 @ X1) @ X1) @ (esk6_2 @ (epred1_3 @ X1) @ X1)|subset @ (breln1invset @ X2 @ X1) @ (cartprod @ X2 @ X2)), inference(spm,[status(thm)],[c_0_13, c_0_24])).
0.13/0.36	thf(c_0_27, plain, ![X1:$i, X2:$i, X3:$i]:(epred2_3 @ subset @ (breln1invset @ X1 @ X2) @ (cartprod @ X1 @ X1)|subset @ (breln1invset @ X3 @ X2) @ (cartprod @ X3 @ X3)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_24]), c_0_26])).
0.13/0.36	thf(c_0_28, negated_conjecture, ~subset @ (breln1invset @ esk1_0 @ esk2_0) @ (cartprod @ esk1_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_11])).
0.13/0.36	thf(c_0_29, plain, ![X1:$i, X2:$i, X3:$i]:(subset @ (breln1invset @ X1 @ X2) @ (cartprod @ X1 @ X1)|subset @ (breln1invset @ X3 @ X2) @ (cartprod @ X3 @ X3)), inference(spm,[status(thm)],[c_0_20, c_0_27])).
0.13/0.36	thf(c_0_30, negated_conjecture, ![X1:$i]:subset @ (breln1invset @ X1 @ esk2_0) @ (cartprod @ X1 @ X1), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.13/0.36	thf(c_0_31, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_30])]), ['proof']).
0.13/0.36	# SZS output end CNFRefutation
0.13/0.36	# Proof object total steps             : 32
0.13/0.36	# Proof object clause steps            : 18
0.13/0.36	# Proof object formula steps           : 14
0.13/0.36	# Proof object conjectures             : 7
0.13/0.36	# Proof object clause conjectures      : 4
0.13/0.36	# Proof object formula conjectures     : 3
0.13/0.36	# Proof object initial clauses used    : 5
0.13/0.36	# Proof object initial formulas used   : 5
0.13/0.36	# Proof object generating inferences   : 8
0.13/0.36	# Proof object simplifying inferences  : 4
0.13/0.36	# Training examples: 0 positive, 0 negative
0.13/0.36	# Parsed axioms                        : 14
0.13/0.36	# Removed by relevancy pruning/SinE    : 0
0.13/0.36	# Initial clauses                      : 17
0.13/0.36	# Removed in clause preprocessing      : 9
0.13/0.36	# Initial clauses in saturation        : 8
0.13/0.36	# Processed clauses                    : 143
0.13/0.36	# ...of these trivial                  : 0
0.13/0.36	# ...subsumed                          : 12
0.13/0.36	# ...remaining for further processing  : 131
0.13/0.36	# Other redundant clauses eliminated   : 3
0.13/0.36	# Clauses deleted for lack of memory   : 0
0.13/0.36	# Backward-subsumed                    : 2
0.13/0.36	# Backward-rewritten                   : 1
0.13/0.36	# Generated clauses                    : 295
0.13/0.36	# ...of the previous two non-trivial   : 174
0.13/0.36	# Contextual simplify-reflections      : 1
0.13/0.36	# Paramodulations                      : 212
0.13/0.36	# Factorizations                       : 6
0.13/0.36	# NegExts                              : 9
0.13/0.36	# Equation resolutions                 : 3
0.13/0.36	# Propositional unsat checks           : 0
0.13/0.36	#    Propositional check models        : 0
0.13/0.36	#    Propositional check unsatisfiable : 0
0.13/0.36	#    Propositional clauses             : 0
0.13/0.36	#    Propositional clauses after purity: 0
0.13/0.36	#    Propositional unsat core size     : 0
0.13/0.36	#    Propositional preprocessing time  : 0.000
0.13/0.36	#    Propositional encoding time       : 0.000
0.13/0.36	#    Propositional solver time         : 0.000
0.13/0.36	#    Success case prop preproc time    : 0.000
0.13/0.36	#    Success case prop encoding time   : 0.000
0.13/0.36	#    Success case prop solver time     : 0.000
0.13/0.36	# Current number of processed clauses  : 114
0.13/0.36	#    Positive orientable unit clauses  : 71
0.13/0.36	#    Positive unorientable unit clauses: 0
0.13/0.36	#    Negative unit clauses             : 0
0.13/0.36	#    Non-unit-clauses                  : 43
0.13/0.36	# Current number of unprocessed clauses: 47
0.13/0.36	# ...number of literals in the above   : 125
0.13/0.36	# Current number of archived formulas  : 0
0.13/0.36	# Current number of archived clauses   : 17
0.13/0.36	# Clause-clause subsumption calls (NU) : 491
0.13/0.36	# Rec. Clause-clause subsumption calls : 443
0.13/0.36	# Non-unit clause-clause subsumptions  : 15
0.13/0.36	# Unit Clause-clause subsumption calls : 0
0.13/0.36	# Rewrite failures with RHS unbound    : 0
0.13/0.36	# BW rewrite match attempts            : 1396
0.13/0.36	# BW rewrite match successes           : 1
0.13/0.36	# Condensation attempts                : 0
0.13/0.36	# Condensation successes               : 0
0.13/0.36	# Termbank termtop insertions          : 7768
0.13/0.36	
0.13/0.36	# -------------------------------------------------
0.13/0.36	# User time                : 0.059 s
0.13/0.36	# System time              : 0.009 s
0.13/0.36	# Total time               : 0.068 s
0.13/0.36	# Maximum resident set size: 1644 pages
0.13/0.36	EOF